On the structure of optimal error-correcting codes
نویسندگان
چکیده
منابع مشابه
Optimal Extension of Error Correcting Output Codes
Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. In this paper, we propose a novel technique called ECOC-ONE (Optimal Node Embedding) to improve an initial ECOC configuration defining a strategy to create new dichotomies and improve optimally the performance. The process of searching for new dichotomies is guided by t...
متن کاملOptimal Extension of Error Correcting Output Codes
Error correcting output codes (ECOC) represent a successful extension of binary classifiers to address the multiclass problem. In this paper, we propose a novel technique called ECOC-ONE (Optimal Node Embedding) to improve an initial ECOC configuration defining a strategy to create new dichotomies and improve optimally the performance. The process of searching for new dichotomies is guided by t...
متن کاملEvolutionary Algorithms for Optimal Error-Correcting Codes
The maximum possible number of codewords in a q-ary code of length n and minimum distance d is denoted Aq(n,d). It is a fundamental problem in coding theory to determine this value for given parameters q, n and d. Codes that attain the maximum are said to be optimal. Unfortunately, for many different values of these parameters, the maximum number of codewords is currently unknown: instead we ha...
متن کاملOptimal Ternary ( 10 , 7 ) Error - Correcting Codes
We describe a series of exhaustive computer searches to determine the maximum number of words in ternary codes of length 10 and minimum distance 7, and to find all such optimal codes. We show that there are exactly 10 inequivalent (10, 14, 7) ternary codes. We prove A3(10, 7) = 14 by showing that none of the (10, 14, 7)3 codes can be extended to a (10, 15, 7)3 code, thereby also giving A3(11, 7...
متن کاملOn Optimal Binary One-Error-Correcting Codes of Lengths
Best and Brouwer [Discrete Math. 17 (1977), 235– 245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length 2m − 4 and 2m − 3, respectively) are optimal. Properties of such codes are here studied, determining among other things parameters of certain subcodes. A utilization of these properties makes a computeraided classification of the optimal binary one-erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00102-7